---
title: "L2-015 互评成绩"
created: 2025-11-28
tags:
  - 算法
---

# L2-015 互评成绩

## 题目 [L2-015 互评成绩](https://pintia.cn/problem-sets/994805046380707840/exam/problems/type/7?problemSetProblemId=994805062432309248&page=1)

![[image-f137fed3.png]]

## 思路分析

![[image-4d3021ca.png]]

## 代码实现

```cpp
#include<bits/stdc++.h>

using namespace std;

#define endl '\n'

using ll = long long;

using ull = unsigned long long;

using PII = pair<int,int>;

using Pll = pair<ll,ll>;

int dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};

const int inf = 0x3f3f3f3f;

priority_queue<double> rating;

int main(){

	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);

	int N,K,M;cin>>N>>K>>M;

	while(N--){

		multiset<int> scores;

		for(int i=0;i<K;i++){

			int score;cin>>score;

			scores.insert(score);

		}

		scores.erase(scores.begin());

		scores.erase(--scores.end());

		double sum=0;

		for(auto s:scores){

			sum+=s;

		}

		rating.push(sum*1.0/(K-2));

	}

	vector<double> ans;

	while(!rating.empty() && M--){

		ans.push_back(rating.top());

		rating.pop();

	}

	reverse(ans.begin(),ans.end());

	for(int i=0; i<ans.size(); i++){

		printf("%.3f",ans[i]);

		if(i!=ans.size()-1)

			printf(" ");

	}

	return 0;

}
```

## 同类题型

## 视频讲解

---
⬅️ [[L2-014 列车调度|L2-014 列车调度]] 🏠 [[00-天梯赛]] ➡️ [[L2-016 愿天下有情人都是失散多年的兄妹|L2-016 愿天下有情人都是失散多年的兄妹]]